High-Efficient Bladeless Expander Concept
نویسندگان
چکیده
Tesla bladeless expanders are promising in energy harvesting and small-scale power generation applications due to their lower cost simplicity design. Although such exhibit very high rotor efficiency (analytical total static ~ 90%), it shows poor performance when coupled with a stator (experimental ~30%) losses present the stator-rotor interaction. This paper presents design experiment of novel, high-efficient expander concept. The concept arises from loss phenomena interaction conventional expanders, which among main causes low performance. is believed bring same performances as traditional ones vanes, compared however machines boast greater simplicity, robustness, absence decay size decreases, competing even contexts for turbomachinery. prototype water working fluid designed developed, representing similitude case liquid butane heat pump. available isentropic across throttling process 3.3 kW @10000 rpm. turbine consists 24 nozzles 150 disks separated by 0.1 mm spacers. shaft connected high-speed electric generator. test on carried out at rotational speeds ranging 3000 rpm 6200 differential pressure up 14 bar. Experimental ventilation characterised its effect discussed. preliminary results under investigation showed satisfactory production an acceptable range. It also shown that able address major i.e., source expander.
منابع مشابه
Efficient and Robust Compressed Sensing using High-Quality Expander Graphs
Expander graphs have been recently proposed to construct efficient compressed sensing algorithms. In particular, it has been shown that any n-dimensional vector that is ksparse (with k n) can be fully recovered using O(k log n k ) measurements and only O(k log n) simple recovery iterations. In this paper we improve upon this result by considering expander graphs with expansion coefficient beyon...
متن کاملEfficient decoding of random errors for quantum expander codes
We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Zémor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with...
متن کاملDeep Expander Networks: Efficient Deep Networks from Graph Theory
Deep Neural Networks, while being unreasonably effective for several vision tasks, have their usage limited by the computational and memory requirements, both during training and inference stages. Analyzing and improving the connectivity patterns between layers of a network has resulted in several compact architectures like GoogleNet, ResNet and DenseNet-BC. In this work, we utilize results fro...
متن کاملExpander Graphs
This paper will introduce expander graphs. Kolmogorov and Barzdin’s proof on the three dimensional realization of networks will be discussed as one of the first examples of expander graphs. The last section will discuss error correcting code as an application of expander graphs to computer science.
متن کاملLinear time, high-rate, list-recoverable codes from expander graphs
We show that expander codes, when properly instantiated, are high-rate list-recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently listdecodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list-recoverable codes with linear-time decoding algorithms have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S web of conferences
سال: 2023
ISSN: ['2555-0403', '2267-1242']
DOI: https://doi.org/10.1051/e3sconf/202341403004